Using an Iterated Prisoner's Dilemma with Exit Option to Study Alliance Behavior: Results of a Tournament and Simulation
نویسندگان
چکیده
Nearly half of all strategic alliances fail (Park and Russo, 1996; Dyer et al., 2001), often because of opportunistic behavior by one party or the other. We use a tournament and simulation to study strategies in an iterated prisoner’s dilemma game with exit option to shed light on how a firm should react to an opportunistic partner. Our results indicate that a firm should give an alliance partner a second chance following an opportunistic act but that subsequent behavior should be contingent on the value of the next best opportunity outside the alliance. Firms should be more forgiving if the potential benefits from the alliance exceed other opportunities. The strategies were also found to be robust across a wide range of game lengths. The implications of these results for alliance strategies are discussed.
منابع مشابه
Modeling alliance activity: Opportunity cost eVects and manipulations in an iterated prisoner’s dilemma with exit option
We model the two-Wrm alliance as an iterated prisoners’ dilemma game with an exit option and test several theoretical predictions over two experimental studies. A new major eVect on alliance performance arises by including the exit option (i.e., the option to end the alliance and receive a Wxed payoV that is less than the payoV for mutual cooperation but greater than the payoV for mutual defect...
متن کاملEvolutionary Tournament-Based Comparison of Learning and Non-Learning Algorithms for Iterated Games
Evolutionary tournaments have been used effectively as a tool for comparing game-playing algorithms. For instance, in the late 1970's, Axelrod organized tournaments to compare algorithms for playing the iterated prisoner's dilemma (PD) game. These tournaments capture the dynamics in a population of agents that periodically adopt relatively successful algorithms in the environment. While these t...
متن کاملAn open reproducible framework for the study of the iterated prisoner's dilemma
(1) Overview Title An open reproducible framework for the study of the iterated prisoner's dilemma. Abstract The Axelrod library is an open source Python package that allows for reproducible game theoretic research into the Iterated Prisoner's Dilemma. This area of research began in the 1980s but suffers from a lack of documentation and test code. The goal of the library is to provide such a re...
متن کاملIterated Prisoner’s Dilemma on Alliance Networks
The objective of this paper is to clarify the characteristics of alliance network that Japan belonged to after the World War II. On that alliance network, which Japan belonged to after the World War II, iterated prisoner's dilemma game will be played.
متن کاملA Round-Robin Tournament of the Iterated Prisoner's Dilemma with Complete Memory-Size-Three Strategies
The results of simulating a prisoner’s dilemma round-robin tournament are presented. In the tournament, each participating strategy played an iterated prisoner’s dilemma against each of the other strategies (roundrobin) and as a variant also against itself. The participants of a tournament are all deterministic strategies and have the same memory size regarding their own and their opponent’s pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational & Mathematical Organization Theory
دوره 11 شماره
صفحات -
تاریخ انتشار 2005